Trip Frequency Scheduling for Terminal Queuing Bus Routes
نویسندگان
چکیده
منابع مشابه
Bus Scheduling with Trip Coordination and Complex Constraints
At the stage of compiling bus schedules, schedulers usually can still manoeuvre the trip timings to a certain extent. Sometimes, even options in the route structures might still be open. Most schedulers, especially in the highly competitive U.K. bus industry, would strive to explore many possibilities in order to derive the best schedules in terms of efficiency, competitiveness, quality of serv...
متن کاملFinding Optimal Timetables for Edinburgh Bus Routes
We present a novel application of stochastic simulation and model-checking methods to determining whether bus services are fulfilling their service-level agreement to provide on-time departures of buses from stops sufficiently often. We use open data on predicted bus arrival times to parameterise a stochastic model of a particular bus route from Edinburgh city centre out to suburban and rural a...
متن کاملHPC to fund relief trip bus transportation
Father Theodore Hesburgh, president emeritus, has become a m em ber o f a twelve person advisory council for First AID, a fund ra is ing pro ject to benefit the N a tio n a l A sso c ia tio n o f People w ith AIDS (NAPWA). F irs t AID w ill consist mainly of a nationwide telephone auc tion in November. The auction, conducted v ia a 900 number, w ill include one-of-a-kind ex periences such as ...
متن کاملSchool bus routing by maximizing trip compatibility
School bus planning is usually divided into routing and scheduling due to the complexity of solving them concurrently. However, the separation between these two steps may lead to worse solutions with higher overall costs than that from solving them together. When finding the minimal number of trips in the routing problem, neglecting the importance of trip compatibility may increase the number o...
متن کاملThe Trip Scheduling Problem
The hours of service regulations of the department of transportation severely restrict the set of feasible driver schedules. So much so that establishing whether a sequence of full truckload transportation requests, each with a dispatch window at the origin, can feasibly be executed by a driver is no longer a matter of simple forward simulation. We consider this problem and prove that the feasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 1994
ISSN: 1474-6670
DOI: 10.1016/s1474-6670(17)47447-7